44,428 research outputs found

    Automatic 3D facial expression recognition using geometric and textured feature fusion

    Get PDF
    3D facial expression recognition has gained more and more interests from affective computing society due to issues such as pose variations and illumination changes caused by 2D imaging having been eliminated. There are many applications that can benefit from this research, such as medical applications involving the detection of pain and psychological effects in patients, in human-computer interaction tasks that intelligent systems use in today's world. In this paper, we look into 3D Facial Expression Recognition, by investigating many feature extraction methods used on the 2D textured images and 3D geometric data, fusing the 2 domains to increase the overall performance. A One Vs All Multi-class SVM Classifier has been adopted to recognize the expressions Angry, Disgust, Fear, Happy, Neutral, Sad and Surprise from the BU-3DFE and Bosphorus databases. The proposed approach displays an increase in performance when the features are fused together

    On routing-optimal networks for multiple unicasts

    Get PDF
    In this paper, we consider the problem of multiple unicast sessions over a directed acyclic graph. It is well known that linear network coding is insufficient for achieving the capacity region, in the general case. However, there exist networks for which routing is sufficient to achieve the whole rate region, and we refer to them as routing-optimal networks. We identify a class of routing-optimal networks, which we refer to as information-distributive networks, defined by three topological features. Due to these features, for each rate vector achieved by network coding, there is always a routing scheme such that it achieves the same rate vector, and the traffic transmitted through the network is exactly the information transmitted over the cut-sets between the sources and the sinks in the corresponding network coding scheme. We present examples of information-distributive networks, including some examples from (1) index coding and (2) from a single unicast session with hard deadline constraint. © 2014 IEEE

    A smart tool for the diagnosis of Parkinsonian syndrome using wireless watches

    Get PDF
    This work is licensed under a Creative Commons Attribution 3.0 License.Early detection and diagnosis of Parkinson disease will provide a good chance for patients to take early actions and prevent its further development. In this paper, a smart tool for the diagnosis of Parkinsonian syndromes is designed and developed using low-cost Texas Instruments eZ430-Chronos wireless watches. With this smart tool, Parkinson Bradykinesia is detected based on the cycle of a human gait, with the watch worn on the foot, and Parkinson Tremor shaking is detected and differed by frequency 0 to 8 Hz on the arm in real-time with a developed statistical diagnosis chart. It can be used in small clinics as well as home environment due to its low-cost and easy-use property

    Explicit birational geometry of 3-folds of general type, I

    Full text link
    Let VV be a complex nonsingular projective 3-fold of general type. We prove P12(V):=dimH0(V,12KV)>0P_{12}(V):=\text{dim} H^0(V, 12K_V)>0 and Pm0(V)>1P_{m_0}(V)>1 for some positive integer m0≤24m_0\leq 24. A direct consequence is the birationality of the pluricanonical map φm\varphi_m for all m≥126m\geq 126. Besides, the canonical volume Vol(V)\text{Vol}(V) has a universal lower bound ν(3)≥163⋅1262\nu(3)\geq \frac{1}{63\cdot 126^2}.Comment: 29 pages, Ann Sci Ecole Norm Sup (to appear

    Explicit birational geometry of threefolds of general type

    Get PDF
    Let VV be a complex nonsingular projective 3-fold of general type. We prove P12(V)>0P_{12}(V)>0 and P24(V)>1P_{24}(V)>1 (which answers an open problem of J. Kollar and S. Mori). We also prove that the canonical volume has an universal lower bound Vol(V)≥1/2660\text{Vol}(V) \geq 1/2660 and that the pluri-canonical map Φm\Phi_m is birational onto its image for all m≥77m\geq 77. As an application of our method, we prove Fletcher's conjecture on weighted hyper-surface 3-folds with terminal quotient singularities. Another featured result is the optimal lower bound Vol(V)≥1/420\text{Vol}(V)\geq {1/420} among all those 3-folds VV with χ(OV)≤1\chi({\mathcal O}_V)\leq 1.Comment: (updated version on October 15, 2007) 55 pages, a couple of missing P_2 terms in Section 5 added and slight rearrangements to the contex
    • …
    corecore